Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques
نویسندگان
چکیده
The quadratic assignment problem (denoted QAP), in the trace formulation over the permutation matrices, is min X2 tr(AXB + C)X t : Several recent lower bounds for QAP are discussed. These bounds are obtained by applying continuous optimization techniques to approximations of this combinatorial optimization problem, as well as by exploiting the special matrix structure of the problem. In particular, we apply constrained eigenvalue techniques, reduced gradient methods, subdiierential calculus, generalizations of trust region methods, and sequential quadratic programming.
منابع مشابه
Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method
This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...
متن کاملContinuous Optimization Methods for the Quadratic Assignment Problem
TAO HUANG: Continuous Optimization Methods for the Quadratic Assignment Problem (Under the direction of Jon W. Tolle) In this dissertation we have studied continuous optimization techniques as they are applied in nonlinear 0-1 programming. Specifically, the methods of relaxation with a penalty function have been carefully investigated. When the strong equivalence properties hold, we are guarant...
متن کاملTrust Regions and the Quadratic Assignment Problem
The quadratic assignment problem (QAP) belongs to the class of NP -hard combinatorial optimization problems. Although it has been studied extensively over the past 35 years, problems of size n 15 still prove to be intractable. Since good lower bounds are necessary to solve larger problem instances, we discuss the class of eigenvalue bounds for QAP and extend previous results of these continuous...
متن کاملTrust Regions and Relaxations for the Quadratic Assignment Problem
General quadratic matrix minimization problems, with orthogonal constraints, arise in continuous relaxations for the (discrete) quadratic assignment problem (QAP). Currently, bounds for QAP are obtained by treating the quadratic and linear parts of the objective function, of the relaxations, separately. This paper handles general objectives as one function. The objectives can be both nonhomogen...
متن کاملA Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem
The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still considered to be large scale. Current successful solution techniques use branch-and-bound methods, which rely on obtaining strong and inexpensive bounds. In this paper, we introduce a new semidefinite programming (SDP) relaxation for gener...
متن کامل